Approximate counting with m counters: A detailed analysis
نویسنده
چکیده
The classical algorithm approximate counting was recently modified by Cichon and Macyna: Instead of one counter, m counters are used, and the assignment of an incoming item to one of the counters is random. The parameter of interest is the sum of the values of all the counters. We analyse expectation and variance, getting explicit and asymptotic formulæ.
منابع مشابه
Approximate counting with m counters: a probabilistic analysis
Motivated by a recent paper by Cichoń and Macyna [1], who introduced m counters (instead of just one) in the approximate counting scheme first analysed by Flajolet [2], we analyse the moments of the sum of the m counters, using techniques that proved to be successful already in several other contexts [11].
متن کاملEvaluation of the Interference of the Microwave Radiation Emitted from GSM Mobile Phones on the Performance of Cell Counters
Abstract Background and Objectives: Incidents related to electromagnetic interference with medical devices have been reported over the past decades. It has also been indicated that the microwave radiation emitted from mobile phones interferes with the operation of medical devices therefore, this study aimed at testing the interference by GSM mobile phones with cell counters. Material and Method...
متن کاملApproximate Counting: A Detailed Analysis
Approximate counting is an algorithm proposed by R. Morris which makes it possible to keep approximate counts of large numbers in small counters. The algorithm is useful for gathering statistics of a large number of events as well as for applications related to data compression (Todd et al.). We provide here a complete analysis of approximate counting which establishes good convergence properti...
متن کاملCount-Min-Log sketch: Approximately counting with approximate counters
Count-Min Sketch [1] is a widely adopted algorithm for approximate event counting in large scale processing. However, the original version of the Count-Min-Sketch (CMS) suffers of some deficiences, especially if one is interested in the low-frequency items, such as in textmining related tasks. Several variants of CMS [5] have been proposed to compensate for the high relative error for low-frequ...
متن کاملA Scalable Approximate Model Counter
Propositional model counting (#SAT), i.e., counting the number of satisfying assignments of a propositional formula, is a problem of significant theoretical and practical interest. Due to the inherent complexity of the problem, approximate model counting, which counts the number of satisfying assignments to within given tolerance and confidence level, was proposed as a practical alternative to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 439 شماره
صفحات -
تاریخ انتشار 2012